A Roadmap for Rules and RuleML in the Semantic Web

نویسنده

  • Benjamin Grosof
چکیده

RuleML is the leading approach to Semantic Web rules: Over the last two and a half years or so, a broad consensus has evolved in the Semantic Web community that the vision of the Semantic Web includes, specifically, rules – as well as ontologies cf. OWL. RuleML has emerged as the leading current standardization approach to rules for the Semantic Web. We are a co-founder and co-chair of the RuleML Initiative, and co-chair of the closely related DAML Rules effort which is currently the main focus of the Joint Committee that developed DAML+OIL. In this paper, we give a roadmap for rules in the Semantic Web, including overview, design rationale, and current directions of RuleML. Declarative knowledge representation: Standards should be founded upon techniques that are well established at a research level. The only approach to making the Semantic Web be " Semantic " that is well understood – and well accepted – from a substantial body of previous research is that it must be founded upon declarative knowledge representation (KR). RuleML, like OWL and RDF, shares this approach. To declarative KR, each then adds Webized syntax. ``Declarative '' here means in the sense of (AI) KR theory. A given set of premises entails a set of sanctioned conclusions, independent of inferencing control strategy or procedural aspects, e.g., independent of whether inferencing direction is goal-directed query answering (``backward'') vs. data-driven (``forward''). Declarativeness greatly facilitates reuse, and multiple kinds of uses, of knowledge. It enables one knowledge-based application (i.e., " agent ") to anticipate precisely and completely what meaning will be drawn by anotheragent from knowledge that has been communicated (e.g., shared). " Webized " here means using the Web's overall open spirit and standards suite – in particular XML, URI's, and namespaces – so as to support modules of multiply authored, widely distributed knowledge. RuleML has initially emphasized XML as the form of syntax, to facilitate building of tools for translation and inferencing. But it also has drafted an RDF syntax and a human-oriented string syntax (as well as an abstract syntax that bridges all these). However, for rules, as for ontologies, the most crucial design choice is the choice of underlying fundamental knowledge representation. Declarative logic programs as KR shared by commercially important rule systems: There are four families of rule systems that are the most currently commercially important (``CCI''): SQL (relational database), Prolog, production rules (cf. OPS5, CLIPS, …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design Rationale for RuleML: A Markup Language for Semantic Web Rules

This paper lays out the design rationale of RuleML, a rule markup language for the Semantic Web. We give an overview of the RuleML Initiative as a Web ontology effort. Subsequently, the modular syntax and semantics of RuleML and the current RuleML 0.8 DTDs are presented (focusing on the Datalog and URI sublanguages). Then we discuss negation handling, priorities/evidences, as well as agents and...

متن کامل

ASP-PROLOG: Composition and Interoperation of Rules

One of the main goals of the Semantic Web initiative [3] is to extend the current Web technology to allow for the development of intelligent agents, which can automatically and unambiguously process the information available on millions of web pages. It has been recognized very early in the development of the Semantic Web that rules are essential for the Web3 and for Semantic Web applications—e...

متن کامل

A procedure for Web Service Selection Using WS-Policy Semantic Matching

In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...

متن کامل

Supporting Uncertainty and Inconsistency in Semantic Web Applications

Ensuring the consistency and completeness of Semantic Web ontologies is practically impossible, because of their scale and highly dynamic nature. Many web applications, therefore, must deal with vague, incomplete and even inconsistent knowledge. Rules were shown to be very effective in processing such knowledge, and future web services are expected to depend heavily on them. RuleML, which is th...

متن کامل

Datalog+, RuleML and OWL 2: Formats and Translations for Existential Rules

This paper is devoted to formats and translations for Datalog+. We first introduce the dlgp format, which extends classical Datalog format to Datalog+. It allows to encode facts, existential rules (including equality), negative constraints and conjunctive queries. Moreover, for compatibility with Semantic Web languages, this format includes Web notions (IRIs and literals, according to Turtle sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005